skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Slonim, Daniel J."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. We examine a class of random walks in random environments on Z with bounded jumps, a generalization of the classic one-dimensional model. The environments we study have i.i.d. transition probability vectors drawn from Dirichlet distributions. For the transient case of this model, we characterize ballisticity: nonzero limiting velocity. We do this in terms of two parameters, κ0 and κ1. The parameter κ0 governs finite trapping effects. The parameter κ1, which already is known to characterize directional transience, also governs repeated traversals of arbitrarily large regions of the graph. We show that the walk is ballistic if and only if min(κ0, κ1) > 1. We prove some stronger results regarding moments of the quenched Green function and other functions that the quenched Green function dominates. These results help us to better understand the phenomena and parameters affecting ballisticity. 
    more » « less
  2. We characterize ballistic behavior for general i.i.d. random walks in random envi- ronments on Z with bounded jumps. The two characterizations we provide do not use uniform ellipticity conditions. They are natural in the sense that they both relate to formulas for the limiting speed in the nearest-neighbor case. 
    more » « less
  3. null (Ed.)